Functional clones and expressibility of partition functions
نویسندگان
چکیده
We study functional clones, which are sets of non-negative pseudo-Boolean functions closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice under set inclusion and are closely related to counting Constraint Satisfaction Problems (CSPs). We identify a sublattice of interesting functional clones and investigate the relationships and properties of the functional clones in this sublattice.
منابع مشابه
Finding p-indecomposable Functions: FCA Approach
The parametric expressibility of functions is a generalization of the expressibility via composition. All parametrically closed classes of functions (p-clones) form a lattice. For finite domains the lattice is shown to be finite, however straight-forward iteration over all functions is infeasible, and so far the p-indecomposable functions are only known for domains with two and three elements. ...
متن کاملON THE COMPATIBILITY OF A CRISP RELATION WITH A FUZZY EQUIVALENCE RELATION
In a recent paper, De Baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. In this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. The reasoninglargely ...
متن کاملComposition of Seed Flour of Selected Nigerian Tea (Camellia sinensis) Clones – A Comparative Study
In the present article, six clones of Nigerian Tea (Camellia sinensis) were selected for comparative study. Proximate, phytochemical and functional characterization of the whole Tea seed flour (TSF) was examined. The characteristics of the expressed oil from the seed of the different clones were also carried out. Results shows that oil content ranged between 22.9% (C318) to 28.9% (C228...
متن کاملClones on Regular Cardinals
We investigate the structure of the lattice of clones on an infinite set X . We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg’s theorem: there are 2 λ many maximal (= “precomplete”) clones on a set of size λ. The clones we construct do not contain all unary functions. We then investigate clones that do contain all unary functions. Using a stron...
متن کاملDiscrete Bounded Bisimulation on Hybrid Automata
Hybrid automata are the prevailing formalisms to reason about systems that consist of discrete and continuous functions. Several specializations like o-minimal hybrid automata have been considered that should (1) retain as much expressibility as possible, and (2) lead to decidable (reachability) problems. However, the discrete transitions of o-minimal automata require constant resets of the con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 687 شماره
صفحات -
تاریخ انتشار 2017